Technische Universität Berlin b e rl in FACHBEREICH 3 MATHEMATIK
نویسنده
چکیده
In 1982 Yamnitsky and Levin gave a variant of the ellipsoid method which uses simplices instead of ellipsoids. Unlike the ellipsoid method this simplices method can be implemented in rational arithmetic. We show, however, that this results in a non-polynomial method since the storage requirement may grow exponentially with the size of the input. Nevertheless , by introducing a rounding procedure we can guarantee polynomiality for both a central-cut and a shallow-cut version. Thus in most applications the simplices method can serve as a substitute for the ellipsoid method. In particular, it performs better than the ellipsoid method if it is used to obtain bounds for the volume of a convex body. Furthermore it can be used to estimate the optimal function value of total approximation problems.
منابع مشابه
GermanTeam 2007 The German National RoboCup Team
1 Deutsches Forschungszentrum für Künstliche Intelligenz, Safe and Secure Cognitive Systems, Robert-Hooke-Str. 5, 28359 Bremen, Germany 2 Fachgebiet Simulation und Systemoptimierung, Fachbereich Informatik, Technische Universität Darmstadt, Hochschulstraße 10, 64289 Darmstadt, Germany 3 Institut für Informatik, LFG Künstliche Intelligenz, Humboldt-Universität zu Berlin, Rudower Chaussee 25, 124...
متن کاملMultiscale Approximation
1 Fachbereich 12 Mathematik und Informatik, Philipps-Universität Marburg Hans-Meerwein-Straße, Lahnberge, D-35032 Marburg {dahlke,koch,werner}@mathematik.uni-marburg.de 2 Zentrum für Technomathematik, Fachbereich 3, Universität Bremen Postfach 330440, D-28334 Bremen {pmaass,dlorenz,schiffi}@math.uni-bremen.de 3 Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB) Takustraße 7, D-14195 Berli...
متن کاملRamsey Theory for Binary Trees and the Separation of Tree-chromatic Number from Path-chromatic Number
We propose a Ramsey theory for binary trees and prove that for every r-coloring of “strong copies” of a small binary tree in a huge complete binary tree T , we can find a strong copy of a large complete binary tree in T with all small copies monochromatic. As an application, we construct a family of graphs which have treechromatic number at most 2 while the path-chromatic number is unbounded. T...
متن کاملTraffic Networks and Flows over Time
1 Brandenburgische Technische Universität Cottbus, Fakultät I — Mathematik, Naturwissenschaften und Informatik, Mathematisches Institut, PSF 10 13 44, 03013 Cottbus, Germany. Email: [email protected], URL: http://www.math.tu-cottbus.de/INSTITUT/lsgdi 2 Technische Universität Berlin, Fakultät II — Mathematik und Naturwissenschaften, Institut für Mathematik, Sekr. MA 5–1, Straße des 17....
متن کاملApproximation and fast calculation of non-local boundary conditions for the time-dependent Schrödinger equation
1 Universität Münster, Institut für Numerische Mathematik, Einsteinstr. 62, D-48149 Münster, Germany (http://www.math.uni-muenster.de/u/arnold/) 2 Technische Universität Berlin, Institut für Mathematik, Str. des 17. Juni 136, D-10623 Berlin, Germany (http://www.math.tu-berlin.de/~ehrhardt/) 3 Keldysh Institute of Applied Mathematics, Russian Academy of Sciences, Moscow, Russia ([email protected]...
متن کامل